Vehicle Coordinated Strategy for Vehicle Routing Problem with Fuzzy Demands
نویسندگان
چکیده
منابع مشابه
Competitive Vehicle Routing Problem with Time Windows and Stochastic Demands
The competitive vehicle routing problem is one of the important issues in transportation area. In this paper a new method for competitive VRP with time windows and stochastic demand is introduced. In the presented method a three time bounds are given and the probability of arrival time between each time bound is assumed to be uniform. The demands of each customer are different in each time wind...
متن کاملA Paired-Vehicle Recourse Strategy for the Vehicle-Routing Problem with Stochastic Demands
This paper presents a paired-vehicle recourse strategy for the vehicle routing problem with stochastic demands (VRPSD). In the VRPSD, a fleet of homogeneous capacitated vehicles is dispatched from a terminal to serve single-period customer demands which are known in distribution when planning but only revealed with certainty upon vehicle arrival. While most existing research for this problem fo...
متن کاملHybrid Metaheuristics for the Vehicle Routing Problem with Stochastic Demands
This article analyzes the performance of metaheuristics on the vehicle routing problem with stochastic demands (VRPSD). The problem is known to have a computational demanding objective function, which could turn to be infeasible when large instances are considered. Fast approximations of the objective function are therefore appealing because they would allow for an extended exploration of the s...
متن کاملMetaheuristics for the Vehicle Routing Problem with Stochastic Demands
X. Yao et al (Eds.): PPSN VIII, LNCS 3242, pp. 450–460, 2004. c © Springer-Verlag Berlin Heidelberg 2004 Abstract. In the vehicle routing problem with stochastic demands a vehicle has to serve a set of customers whose exact demand is known only upon arrival at the customer’s location. The objective is to find a permutation of the customers (an a priori tour) that minimizes the expected distance...
متن کاملMeta Heuristic Algorithms for Vehicle Routing Problem with Stochastic Demands
Problem statement: The shipment of goods from manufacturer to the consumer is a focal point of distribution logistics. In reality, the demand of consumers is not known a priori. This kind of distribution is dealt by Stochastic Vehicle Routing Problem (SVRP) which is a NP-hard problem. In this proposed work, VRP with stochastic demand is considered. A probability distribution is considered as a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Problems in Engineering
سال: 2016
ISSN: 1024-123X,1563-5147
DOI: 10.1155/2016/9071394